Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
نویسندگان
چکیده
We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games. For some settings, we show that the solutions are necessarily Pareto optimal. When this is not the case, we provide a measure to quantify the distance of the solution from Pareto efficiency. Using this measure, we provide upper and lower bounds on the “Pareto inefficiency” of the different solutions. The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks.
منابع مشابه
Load Balancing in Distributed Systems: An Approach Using Cooperative Games
In this paper we formulate the static load balancing problem in single class job distributed systems as a cooperative game among computers. It is shown that the Nash Bargaining Solution (NBS) provides a Pareto optimal allocation which is also fair to all jobs. We propose a cooperative load balancing game and present the structure of the NBS. For this game an algorithm for computing NBS is deriv...
متن کاملPareto Optimal Balancing of Four-bar Mechanisms Using Multi-Objective Differential Evolution Algorithm
Four-bar mechanisms are widely used in the industry especially in rotary engines. These mechanisms are usually applied for attaining a special motion duty like path generation; their high speeds in the industry cause an unbalancing problem. Hence, dynamic balancing is essential for their greater efficiency. In this research study, a multi-objective differential evolution algorithm is used for P...
متن کاملA Multiobjective Off-line Routing Model for MPLS Networks
This study focuses on the multiobjectivity in the off-line routing of QoS traffic in MultiProtocol Label Switching (MPLS) Networks. The routing problem is formulated as a multiobjective mixed-integer programming. It aims at exploring the trade-offs between three objectives, namely minimal routing delay, optimal load-balance in the network, and minimal splitting of traffic trunks. For the multio...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملFinding the pareto curve in bimatrix games is easy
Pareto efficiency is a widely used property in solution concepts for cooperative and non–cooperative game–theoretic settings and, more generally, in multi–objective problems. However, finding or even approximating (when the objective functions are not convex) the Pareto curve is hard. Most of the literature focuses on computing concise representations to approximate the Pareto curve or on explo...
متن کامل